منابع مشابه
Uniqueness in Logic Puzzles
Cameron Browne, Queensland University of Technology (QUT) Pure deduction puzzles typically have a single unique solution. However, some puzzle setters argue that challenges with multiple solutions are also valid, if they can be solved by eliminating choices that lead to ambiguous states. This paper considers the arguments for and against this position, and presents a counterexample that demonst...
متن کاملGraded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria
Strategy Logic (SL) is a well established formalism for strategic reasoning in multi-agent systems. In a nutshell, SL is built over LTL and treats strategies as first-order objects that can be associated with agents by means of a binding operator. In this work we introduce Graded Strategy Logic (GradedSL), an extension of SL by graded quantifiers over tuples of strategy variables such as “there...
متن کاملUniqueness of Normal Proofs in Implicational Intuitionistic Logic
A minimal theorem in a logic L is an L-theorem which is not a nontrivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal impli-cational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicat...
متن کاملFrom Propositional Logic to Plausible Reasoning: A Uniqueness Theorem
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be preserved in the extended logic; as such, the requirements are simpler and less problematic than those used in Cox’s Theorem and its variants. As with Cox’s Th...
متن کاملUniqueness and non-uniqueness in percolation theory
This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on Z d and, more generally, on transitive graphs. For iid percolation on Z, uniqueness of the infinite cluster is a classical result, while on certain other transitive graphs uniqueness may fail. Key properties of the graphs in this context turn out to be amenability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.006